Factors of low individual degree polynomials
نویسندگان
چکیده
منابع مشابه
Factors of Polynomials of Low Individual Degree
In [kal89], Kaltofen proved the remarkable fact that multivariate polynomial factorization can be done efficiently, in randomized polynomial time. Still, more than twenty years after Kaltofen’s work, many questions remain unanswered regarding the complexity aspects of polynomial factorization, such as the question of whether factors of polynomials efficiently computed by arithmetic formulas als...
متن کاملTesting Low-Degree Polynomials over
We describe an efficient randomized algorithm to test if a given binary function is a low-degree polynomial (that is, a sum of low-degree monomials). For a given integer and a given real , the algorithm queries at !" # points. If is a polynomial of degree at most , the algorithm always accepts, and if the value of has to be modified on at least an fraction of all inputs in order to transform it...
متن کاملInfluences in low-degree polynomials
Definition 3 A decision tree is a binary tree T. Each internal node of T is labeled with a variable xi and each leaf is labeled with a value −1 or 1. Given an input x ∈ {−1, 1}n, the tree is evaluated as follows. Start at the root; if this is a leaf then stop. Otherwise, query the value of the variable xi. If xi = −1 then recursively evaluate the left subtree, if xi = 1 then recursively evaluat...
متن کاملBounded-degree factors of lacunary multivariate polynomials
In this paper, we present a new method for computing boundeddegree factors of lacunary multivariate polynomials. In particular for polynomials over number fields, we give a new algorithm that takes as input a multivariate polynomial f in lacunary representation and a degree bound d and computes the irreducible factors of degree at most d of f in time polynomial in the lacunary size of f and in ...
متن کاملThe Fourier structure of low degree polynomials
We study the structure of the Fourier coefficients of low degree multivariate polynomials over finite fields. We consider three properties: (i) the number of nonzero Fourier coefficients; (ii) the sum of the absolute value of the Fourier coefficients; and (iii) the size of the linear subspace spanned by the nonzero Fourier coefficients. For quadratic polynomials, tight relations are known betwe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2016
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-016-0130-2